Weighted Greedy Dual Size Frequency Based Caching Replacement Algorithm
نویسندگان
چکیده
منابع مشابه
Popularity-Aware Greedy Dual-Size Web Proxy Caching Algorithms
Web caching aims to reduce network traÆc, server load, and user-perceived retrieval delays by replicating \popular" content on proxy caches that are strategically placed within the network. While key to e ective cache utilization, popularity information (e.g. relative access frequencies of objects requested through a proxy) is seldom incorporated directly in cache replacement algorithms. Rather...
متن کاملImproving WWW Proxies Performance with Greedy-Dual- Size-Frequency Caching Policy
Web, HTTP, WWW proxies, caching policies, replacement algorithms, performance Web proxy caches are used to improve performance of the WWW. Since the majority of Web documents are static documents, caching them at WWW proxies reduces both network traffic and response time. One of the keys to better proxy cache performance is an efficient caching policy which keeps in the cache popular documents ...
متن کاملThe Primal-Dual Greedy Algorithm for Weighted Covering Problems
We present a general approximation framework for weighted integer covering problems. In a weighted integer covering problem, the goal is to determine a non-negative integer solution x to system {Ax ≥ r} minimizing a non-negative cost function cx (of appropriate dimensions). All coefficients in matrix A are assumed to be non-negative. We analyze the performance of a very simple primal-dual greed...
متن کاملDual Greedy Algorithm for Conic Optimization Problem
In the paper we propose an algorithm for nding approximate sparse solutions of convex optimization problem with conic constraints and examine convergence properties of the algorithm with application to the index tracking problem and unconstrained l1-penalized regression.
متن کاملLRU-SP: A Size-Adjusted and Popularity-Aware LRU Replacement Algorithm for Web Caching
This paper presents LRU-SP, a size-adjusted and popularity-aware extension to Least Recently Used (LRU) for caching web objects. The standard LRU, focusing on recently used and equal sized objects, is not suitable for the web context because web objects vary dramatically in size and the recently accessed objects may possibly differ from popular ones. LRU-SP is built on two LRU extensions, namel...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2018
ISSN: 2169-3536
DOI: 10.1109/access.2018.2790381